全文获取类型
收费全文 | 204篇 |
免费 | 12篇 |
专业分类
化学 | 36篇 |
力学 | 2篇 |
数学 | 71篇 |
物理学 | 107篇 |
出版年
2023年 | 1篇 |
2021年 | 3篇 |
2020年 | 5篇 |
2019年 | 2篇 |
2018年 | 6篇 |
2017年 | 8篇 |
2016年 | 11篇 |
2015年 | 5篇 |
2014年 | 9篇 |
2013年 | 7篇 |
2012年 | 9篇 |
2011年 | 14篇 |
2010年 | 4篇 |
2009年 | 11篇 |
2008年 | 8篇 |
2007年 | 10篇 |
2006年 | 11篇 |
2005年 | 2篇 |
2004年 | 9篇 |
2003年 | 4篇 |
2002年 | 6篇 |
2001年 | 2篇 |
2000年 | 3篇 |
1999年 | 2篇 |
1998年 | 3篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1994年 | 4篇 |
1993年 | 2篇 |
1992年 | 4篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1988年 | 2篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 2篇 |
1982年 | 5篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 10篇 |
1977年 | 2篇 |
1976年 | 5篇 |
1975年 | 3篇 |
1974年 | 4篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有216条查询结果,搜索用时 187 毫秒
41.
We propose a method based on the electromagnetically induced transparency (EIT) phenomenon for the detection of molecules which exist as a small minority in the presence of a majority of absorbers. The EIT effect we employ effectively eliminates the absorption of the majority species in the spectral region where it overlaps with the absorption of the minority species. The method can also be used to enhance local-modes transitions which overlap spectrally with a background of other local-modes transitions of the same molecule. The general theory is applied to the case of sparse and congested background spectra within the same molecule and to the recording of the spectra of isotopomers (of chlorine and methanol) that are in minority relative to other isotopomers which constitute the majority of molecules present. 相似文献
42.
Yair Shapira Moshe Israeli Avram Sidi Uzi Zrahia 《Numerical Methods for Partial Differential Equations》1999,15(5):535-543
Spectral element schemes for the solution of elliptic boundary value problems are considered. Preconditioning methods based on finite difference and finite element schemes are implemented. Numerical experiments show that inverting the preconditioner by a single multigrid iteration is most efficient and that the finite difference preconditioner is superior to the finite element one for both definite and indefinite problems. A multigrid preconditioner is also derived from the finite difference preconditioner and is found suitable for the CGS acceleration method. It is pointed out that, for the finite difference and finite element preconditioners, CGS does not always converge to the accurate algebraic solution. © 1999 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 15: 535–543, 1999 相似文献
43.
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has, in every column, blocks of consecutive 1s, each corresponding to a shift. We focus on three types of shift scheduling problems classified according to the column structure in the constraint matrix: columns of consecutive 1s, columns of cyclical 1s, and columns of k consecutive blocks. In particular, the complexity of the cyclical scheduling problem, where the matrix satisfies the property of cyclical 1s in each column, was noted recently by Hochbaum and Tucker to be open. They further showed that the unit demand case is polynomially solvable. Here we extend this result to the uniform requirements case, and provide a 2-approximation algorithm for the non-uniform case. We also establish that the cyclical scheduling problem’s complexity is equivalent to that of the exact matching problem—a problem the complexity status of which is known to be randomized polynomial (RP). We then investigate the three types of shift scheduling problems and show that, while the consecutive ones version is polynomial and the k-block columns version is NP-hard (for k≥2), for the k-blocks problem we give a simple k-approximation algorithm, which is the first approximation algorithm determined for the problem. 相似文献
44.
Let Φ be a set of general boolean functions on n variables, such that each function depends on exactly k variables, and each variable can take a value from [1,d]. We say that Φ is ε-far from satisfiable, if one must remove at least εnk functions in order to make the set of remaining functions satisfiable. Our main result is that if Φ is ε-far from satisfiable, then most of the induced sets of functions, on sets of variables of size c(k,d)/ε2, are not satisfiable, where c(k,d) depends only on k and d. Using the above claim, we obtain similar results for k-SAT and k-NAEQ-SAT.Assume we relax the decision problem of whether an instance of one of the above mentioned problems is satisfiable or not, to the problem of deciding whether an instance is satisfiable or ε-far from satisfiable. While the above decision problems are NP-hard, our result implies that we can solve their relaxed versions, that is, distinguishing between satisfiable and ε-far from satisfiable instances, in randomized constant time.From the above result we obtain as a special case, previous results of Alon and Krivelevich, and of Czumaj and Sohler, concerning testing of graphs and hypergraphs colorability. We also discuss the difference between testing with one-sided and two-sided error. 相似文献
45.
46.
47.
48.
We prove packing and counting theorems for arbitrarily oriented Hamilton cycles in (n, p) for nearly optimal p (up to a factor). In particular, we show that given t = (1 ? o(1))np Hamilton cycles C1,…,Ct, each of which is oriented arbitrarily, a digraph ~(n, p) w.h.p. contains edge disjoint copies of C1,…,Ct, provided . We also show that given an arbitrarily oriented n‐vertex cycle C, a random digraph ~(n, p) w.h.p. contains (1 ± o(1))n!pn copies of C, provided . 相似文献
49.
Let fr(n,v,e) denote the maximum number of edges in an r-uniform hypergraph on n vertices, which does not contain e edges spanned by v vertices. Extending previous results of Ruzsa and Szemerédi and of Erdős, Frankl and R?dl, we partially resolve a problem
raised by Brown, Erdős and Sós in 1973, by showing that for any fixed 2≤k<r, we have
* Researchs upported in part by a USA-Israeli BSF grant, by the Israel Science Foundation and by the Hermann Minkowski Minerva
Center for Geometry at Tel Aviv University.
† This work forms part of the author's Ph.D. Thesis. Research supported by a Charles Clore Foundation Fellowship and an IBM
Ph.D. Fellowship. 相似文献
50.
Giambattista Giacomin Christophe Poquet Assaf Shapira 《Journal of Differential Equations》2018,264(2):1019-1049
We study the effect of additive Brownian noise on an ODE system that has a stable hyperbolic limit cycle, for initial data that are attracted to the limit cycle. The analysis is performed in the limit of small noise – that is, we modulate the noise by a factor – and on a long time horizon. We prove explicit estimates on the proximity of the noisy trajectory and the limit cycle up to times , , and we show both that on the time scale the dephasing (i.e., the difference between noiseless and noisy system measured in a natural coordinate system that involves a phase) is close to a Brownian motion with constant drift, and that on longer time scales the dephasing dynamics is dominated by the drift. The natural choice of coordinates, that reduces the dynamics in a neighborhood of the cycle to a rotation, plays a central role and makes the connection with the applied science literature in which noisy limit cycle dynamics are often reduced to a diffusion model for the phase of the limit cycle. 相似文献